Computational Study of Fast Methods for the Eikonal Equation

نویسندگان

  • Pierre-Alain Gremaud
  • Christopher M. Kuster
چکیده

A computational study of the Fast Marching and the Fast Sweeping methods for the Eikonal equation is given. It is shown that even though Fast Sweeping requires asymptotically less operations than Fast Marching, the latter method is faster than the former for the problems under consideration and for realistic grid sizes. Fully second order generalizations of methods of this type for problems with obstacles are proposed.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Optimal Control of Light Propagation Governed by Eikonal Equation within Inhomogeneous Media Using Computational Adjoint Approach

A mathematical model is presented in the present study to control‎ ‎the light propagation in an inhomogeneous media‎. ‎The method is ‎based on the identification of the optimal materials distribution‎ ‎in the media such that the trajectories of light rays follow the‎ ‎desired path‎. ‎The problem is formulated as a distributed parameter ‎identification problem and it is solved by a numerical met...

متن کامل

A fast marching algorithm for the factored eikonal equation

The eikonal equation is instrumental in many applications in several fields ranging from computer vision to geoscience. This equation can be efficiently solved using the iterative Fast Sweeping (FS) methods and the direct Fast Marching (FM) methods. However, when used for a point source, the original eikonal equation is known to yield inaccurate numerical solutions, because of a singularity at ...

متن کامل

High-Order Factorization Based High-Order Hybrid Fast Sweeping Methods for Point-Source Eikonal Equations

The solution for the eikonal equation with a point-source condition has an upwind singularity at the source point as the eikonal solution behaves like a distance function at and near the source. As such, the eikonal function is not differentiable at the source so that all formally high-order numerical schemes for the eikonal equation yield first-order convergence and relatively large errors. Th...

متن کامل

Computing geodesic paths on triangulated manifolds

Solving the Eikonal equation on a surface allows establishment of a curvilinear coordinate system which facilitates many types of physics-based simulations and measurements. Existing methods that solve the Eikonal equation on surface triangulations suffer from significant limitations prohibiting their use in many applications. First, the surface may not have any holes. Second, every obtuse tria...

متن کامل

Fast sweeping method for the factored eikonal equation

We develop a fast sweeping method for the factored eikonal equation. By decomposing the solution of a general eikonal equation as the product of two factors: the first factor is the solution to a simple eikonal equation (such as distance) or a previously computed solution to an approximate eikonal equation. The second factor is a necessary modification/correction. Appropriate discretization and...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • SIAM J. Scientific Computing

دوره 27  شماره 

صفحات  -

تاریخ انتشار 2006